Serially Concatenated Convolutional Codes with Product Distance
نویسندگان
چکیده
J. Freudenberger*, R. Jordan*, M. Bossert*, and S. Shavgulidze** * University of Ulm, Dep. of Information Technology Albert-Einstein-Allee 43, D-89081 Ulm, Germany Email: jfreuden,jordan,[email protected] ** Georgian Technical University, Dep. of Digital Communication Theory Kostava str. 77, Tbilisi 380075, Georgia Email: sergo [email protected] Abstract: In this paper we investigate serially concatenated convolutional codes, both with randomly chosen and designed permutations. We prove that overall minimum distances greater or equal to the product of the free distances of the component codes are achievable. Moreover, we present conditions for the permutation which guarantee an overall product distance.
منابع مشابه
On the Distance Growth Properties of Double Serially Concatenated Convolutional Codes
It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper we present a method to obtain the minimum distance growth rate coefficient of double-serially concatenated codes and determine the growth coefficient of the rate 1/2 double serially concatenated code consisting of an outer memory-one convolutio...
متن کاملAnalysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers
A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...
متن کاملWoven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملOn the Design of Double Serially Concatenated Codes with an Outer Repetition Code
Motivated by the recent discovery that repeat-accumulate-accumulate (RAA) codes with a repetition factor of three or larger are asymptotically good, we focus on the design of double-serially concatenated codes (DSCCs) with an outer repetition code. The main design goal is to obtain rate-1/2 codes with minimum distance approaching the Gilbert-Varshamov bound (GVB), while still maintaining a good...
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کامل